Semi-online hierarchical load balancing problem with bounded processing times
نویسندگان
چکیده
منابع مشابه
Semi-online scheduling on 2 machines under a grade of service provision with bounded processing times
We study the problem of semi-online scheduling on 2 machines under a grade of service (GoS). GoS means that some jobs have to be processed by some machines to be guaranteed a high quality. The problem is online in the sense that jobs are presented one by one, and each job shall be assigned to a time slot on its arrival. Assume that the processing time pi of every job Ji is bounded by an interva...
متن کاملLoad Balancing Routing with Bounded Stretch
Routing in wireless networks has been heavily studied in the last decade. Many routing protocols are based on classic shortest path algorithms. However, shortest path-based routing protocols suffer from uneven load distribution in the network, such as crowed center effect where the center nodes have more load than the nodes in the periphery. Aiming to balance the load, we propose a novel routin...
متن کاملThe load-distance balancing problem
Problems dealing with assignment of clients to servers have been widely studied. However, they usually do not model the fact that the delay incurred by a client is a function of both the distance to the assigned server and the load on this server, under a given assignment. We study a problem referred to as the Load-Distance Balancing problem (or LDB), where the objective is assigning a set of c...
متن کاملPeriodic hierarchical load balancing for large supercomputers
Large parallel machines with hundreds of thousands of processors are being built. Ensuring good load balance is critical for scaling certain classes of parallel applications on even thousands of processors. Centralized load balancing algorithms suffer from scalability problems, especially on machines with relatively small amount of memory. Fully distributed load balancing algorithms, on the oth...
متن کاملAn optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
This paper deals with a two-machine open shop scheduling problem. The objective is to minimize the makespan. Jobs arrive over time. We study preemptionresume model, i.e., the currently processed job may be preempted at any moment in necessary and be resumed some time later. Let p1, j and p2, j denote the processing time of a job J j on the two machines M1 and M2, respectively. Bounded processin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.03.050